Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
341	A Global Constraint for Total Weighted Completion Time Andr´ as Kov´ acs1,3 and J. Christopher Beck2 1 Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2007-03-26 13:14:36 Applied mathematics Constraint programming Combinatorial optimization Linear programming Local consistency Travelling salesman problem Linear programming relaxation Scheduling Computational complexity theory Operations research Mathematics Mathematical optimization
342	Cache-Oblivious Index for Approximate String Matching Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-07-27 14:38:02 Analysis of algorithms Cache Computational complexity theory Search algorithms B-tree Trie Cache-oblivious algorithm Suffix tree Time complexity Theoretical computer science Computer science Computing
343	CS109A Notes for LecturePrograms with Function Calls Establish a size measure for each function. Let f ( ) be the running time of function . When evaluating a simple or compound staten Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:57:58 Computer science Mathematical notation Asymptotic analysis Functional languages Procedural programming languages Big O notation Time complexity Summation ML Theoretical computer science Mathematics Analysis of algorithms
344	Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx† Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-05-30 15:14:06 NP-complete problems Complexity classes Mathematical optimization Analysis of algorithms Parameterized complexity Exponential time hypothesis NP-complete Time complexity Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
345	Guide to Examinable Material COMS31900 – Advanced AlgorithmsDecember 2013 Overview This guide is organised topic by topic in the same order that the course was taught. References into the lectures are giv Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:17 Applied mathematics Hashing Suffix tree Hash function Hash table Vertex cover Bloom filter Universal hashing Time complexity Theoretical computer science Search algorithms Computational complexity theory
346	1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti Add to Reading List Source URL: lii.rwth-aachen.de Language: English - Date: 2014-02-04 08:14:43 NP-complete problems Analysis of algorithms Computability theory Complexity classes Parameterized complexity Dominating set Time complexity Computable function Parameter Theoretical computer science Computational complexity theory Applied mathematics
347	Coursework COMS31900 – Advanced AlgorithmsNovember 2013 Deadline is Sunday, 15 December 2013 at 23:59:59. This is both the normal and late deadline. Submission. The coursework must be submitted online as Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:17 Computational complexity theory Lowest common ancestor Suffix tree String Time complexity Algorithm Theoretical computer science Mathematics Applied mathematics
348	Virtualization Small and midsize businesses are making virtualization one of the hottest trends in IT. The reasons? Virtualization reduces the cost and complexity of technology, frees up time to make their businesses mor Add to Reading List Source URL: www.perryman-sw.com Language: English - Date: 2011-08-24 16:21:42 Virtualization Hardware virtualization Desktop virtualization System software Software Virtual machines
349	Preprint. To appear in Data Mining and Knowledge Discovery. DOIs10618 – Online available. The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization Robert Bredere Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:46 Analysis of algorithms Parameterized complexity Time complexity Anonymity Matrix NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
350	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE